Decentralized Optimization Over the Stiefel Manifold by an Approximate Augmented Lagrangian Function

نویسندگان

چکیده

In this paper, we focus on the decentralized optimization problem over Stiefel manifold, which is defined a connected network of $d$ agents. The objective an average local functions, and each function privately held by agent encodes its data. agents can only communicate with their neighbors in collaborative effort to solve problem. existing methods, multiple rounds communications are required guarantee convergence, giving rise high communication costs. contrast, paper proposes algorithm, called DESTINY, invokes single round per iteration. DESTINY combines gradient tracking techniques novel approximate augmented Lagrangian function. global convergence stationary points rigorously established. Comprehensive numerical experiments demonstrate that has strong potential deliver cutting-edge performance solving variety testing problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadratic programs over the Stiefel manifold

We characterize the optimal solution of a quadratic program over the Stiefel manifold with an objective function in trace formulation. The result is applied to relaxations of HQAP and MTLS. Finally, we show that strong duality holds for the Lagrangian dual, provided some redundant constraints are added to the primal program. © 2005 Elsevier B.V. All rights reserved.

متن کامل

Robust PCA: Optimization of the Robust Reconstruction Error Over the Stiefel Manifold

Abstract. It is well known that Principal Component Analysis (PCA) is strongly affected by outliers and a lot of effort has been put into robustification of PCA. In this paper we present a new algorithm for robust PCA minimizing the trimmed reconstruction error. By directly minimizing over the Stiefel manifold, we avoid deflation as often used by projection pursuit methods. In distinction to ot...

متن کامل

An augmented Lagrangian method for distributed optimization

We propose a novel distributed method for convex optimization problems with a certain separability structure. The method is based on the augmented Lagrangian framework. We analyze its convergence and provide an application to two network models, as well as to a two-stage stochastic optimization problem. The proposed method compares favorably to two augmented Lagrangian decomposition methods kno...

متن کامل

Systems Engineering: Optimization on Stiefel Manifold for MIMO System

Applications of multiple input and multiple output (MIMO) with Stiefel manifold are growing in the next generation communications and their system engineering developments. These applications need to be optimized efficiently with less complexity and cost. In this research, optimization problems in MIMO systems using Stiefel manifold are considered. As far as general manifolds are concerned, opt...

متن کامل

Dihedral manifold approximate fibrations over the circle

Consider the cyclic group C2 of order two acting by complex-conjugation on the unit circle S1. The main result is that a finitely dominated manifold W of dimension> 4 admits a cocompact, free, discontinuous action by the infinite dihedral group D∞ if and only if W is the infinite cyclic cover of a free C2-manifold M such that M admits a C2-equivariant manifold approximate fibration to S1. The n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3182883